home *** CD-ROM | disk | FTP | other *** search
/ NetNews Offline 2 / NetNews Offline Volume 2.iso / news / comp / lang / c-part2 / 13065 < prev    next >
Encoding:
Internet Message Format  |  1996-08-05  |  729 b 
  1. From: lBarnett@msn.com (Louis Barnett)
  2. Subject: Re: "Best fit" algorithm (help)
  3. Date: 4 Apr 96 08:25:54 -0800
  4. References: <APC&7'0'22b6b83'874@peg.apc.org> <4jhlu7$5m2@airdmhor.gen.nz> <4ji4b1$jc5@news1.mnsinc.com> <4jnq7t$643@airdmhor.gen.nz>
  5. Message-ID: <00001a80+00008bdd@msn.com>
  6. Path: news.msn.com!msn.com
  7. Newsgroups: comp.lang.c
  8. Organization: The Microsoft Network (msn.com)
  9.  
  10. Your friend is wrong. There are a number of very good best fit 
  11. algorithms. A lot depends on the problem you are trying to solve 
  12. (i.e., line balancing, knapsacks, optimum packing and fitting, etc.). 
  13. I'm a little out of touch with this subject now. Suggest you pose 
  14. your question to the folks at sci.op-research; they're very helpful 
  15. and pros.
  16.